Classification through Maximizing Density
نویسندگان
چکیده
This paper presents a novel method for classification, which makes use of the models built by the lattice machine (LM) [1, 3]. The LM approximates data resulting in, as a model of data, a set of hyper tuples that are equilabelled, supported and maximal. The method presented in this paper uses the LM model of data to classify new data with a view to maximising the density of the model. Experiments show that this method, when used with the LM, outperforms the C2 algorithm in [3] and it is comparable to the C5.0 classification algorithm.
منابع مشابه
TARGETING CUSTOMERS: A FUZZY CLASSIFICATION APPROACH
Nowadays, marketing serves the purpose of maximizing customer lifetime value (CLV) and customer equity, which is the sum of the lifetime values of the company’s customers. But, CLV calculation encounters some difficulties which limit the usage of this technique. Nonetheless, companies looking for methods to know how to calculate their customers’ CLV. In this paper, fuzzy classification rules we...
متن کاملNeural Network Classification: Maximizing Zero-Error Density
We propose a new cost function for neural network classification: the error density at the origin. This method provides a simple objective function that can be easily plugged in the usual backpropagation algorithm, giving a simple and efficient learning scheme. Experimental work shows the effectiveness and superiority of the proposed method when compared to the usual mean square error criteria ...
متن کاملEstimation and Classification by Sigmoids based on Mutual Information
An estimate of the probability density function of a random vector is obtained by maximizing the mutual information between the input and the output of a feedforward network of sigmoidal units with respect to the input weights. Classification problems can be solved by selecting the class associated with the maximal estimated density. Newton's method, applied to an estimated density, yields a re...
متن کاملProjection Pursuit Through Relative Entropy Minimization
Consider a de ned density on a set of very large dimension. It is quite di cult to nd an estimate of this density from a data set. However, it is possible through a projection pursuit methodology to solve this problem. In his seminal article, Huber (see "Projection pursuit", Annals of Statistics, 1985) demonstrates the interest of his method in a very simple given case. He considers the factori...
متن کاملSome remarks on modularity density
A “quantitative function” for community detection called modularity density has been proposed by Li, Zhang, Wang, Zhang, and Chen in [Phys. Rev. E 77, 036109 (2008)]. We study the modularity density maximization problem and we discuss some features of the optimal solution. More precisely, we show that in the optimal solution there can be communities having negative modularity density, and we pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001